Steiner systems $$S(2, 4, \frac{3^m-1}{2})$$ and 2-designs from ternary linear codes of length $$\frac{3^m-1}{2}$$

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Classification of Certain Ternary Codes of Length 12

A ternary [n, k] code C is a k-dimensional vector subspace of Fn3 , where F3 denotes the finite field of order 3. The weight wt(x) of a vector x is the number of non-zero components of x. The minimum non-zero weight of all codewords in C is called the minimum weight of C. A ternary [n, k, d] code is a ternary [n, k] code with minimum weight d. Throughout this note, we denote the minimum weight ...

متن کامل

Vasiliev codes of length n = 2 m and Steiner systems S ( n , 4 , 3 )

We study the extended binary perfect nonlinear Vasiliev codes of length n = 2m and Steiner systems S(n, 4, 3) of rank n − m over F2. The generalized concatenation (GC) construction of Vasiliev codes induces a variant of the doubling construction of Steiner systems S(n, 4, 3) of rank n − m over F2. We prove that any Steiner system S(n = 2m, 4, 3) of rank n − m is obtained by such doubling constr...

متن کامل

Ternary codes through ternary designs

It is known that under certain conditions the incidence matrix of a balanced incomplete block design (v, b, r, k, λ) gives a binary code of length b and size 2(v + 1). Here we investigate the conditions where a balanced ternary design gives a similar ternary code.

متن کامل

Enumeration of 2-(12, 3, 2) designs

A backtrack search with isomorph rejection is carried out to enumerate the 2-(12,3,2) designs. There are 242 995 846 such designs, which have automorphism groups whose size range from 1 to 1536. There are 88 616 310 simple designs. The number of resolvable designs is 62 929; these have 74 700 nonisomorphic resolutions. We use the following standard notations. A t-(v, k, >.) design is a family o...

متن کامل

Some Optimal Codes From Designs

The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2019

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-019-00651-8